Parallel Matrix Multiplication on a Linear Array with a Recon gurable Pipelined Bus System
نویسندگان
چکیده
The known fast sequential algorithms for multiplying two N N matrices over an arbitrary ring have time complexity O N where The current best value of is less than We show that for all p N multiplying two N N matrices can be performed on a p processor linear array with a recon gurable pipelined bus system LARPBS in
منابع مشابه
Solving graph theory problems using recon®gurable pipelined optical buses
We solve a number of important and interesting problems from graph theory on a linear array with a recon®gurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value ®nding algorithms, and are currently the fastest algorithms. We also distinguish the two cases where weights have bounded/unbounded magnitude and precision. Ó 2000 Published by Else...
متن کاملSolving Graph Theory Problems Using Reconfigurable Pipelined Optical Buses
We solve a number of important and interesting problems from graph theory on a linear array with a recon gurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value nding algorithms, and are currently the fastest algorithms. We also distinguish the two cases where weights have bounded/unbounded magnitude and precision.
متن کاملFast and Scalable Parallel Matrix Computations with Optical Buses
We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with recon gurable pipelined optical bus systems. These problems include computing the Nth power, the inverse, the characteristic polynomial, the determinant, the rank, and an LUand a QR-factorization of a matrix, and solving linear systems of equations. These com...
متن کاملFault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System
Recently, manymodels using recon gurable optically pipelined buses have been proposed in the literature. All algorithms developed for these models assume that a healthy system is available. We present some fundamental algorithms that are able to tolerate up to N=2 faults on an N -processor LARPBS (one particular optical model). We then extend these results to apply to other algorithms in the ar...
متن کاملParallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System Parallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity O(N), where 2 < < 3. The current best value of is less than 2.3755. We show that for all 1 p N , multiplying two N N matrices can be performed on a p-processor linear array with a reconngurable pipelined bus system (LARPBS) in O N p + N 2 p 2== log p time. This is currently the fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999